139 research outputs found
Bounded Counter Languages
We show that deterministic finite automata equipped with two-way heads
are equivalent to deterministic machines with a single two-way input head and
linearly bounded counters if the accepted language is strictly bounded,
i.e., a subset of for a fixed sequence of symbols . Then we investigate linear speed-up for counter machines. Lower
and upper time bounds for concrete recognition problems are shown, implying
that in general linear speed-up does not hold for counter machines. For bounded
languages we develop a technique for speeding up computations by any constant
factor at the expense of adding a fixed number of counters
The Power of Centralized PC Systems of Pushdown Automata
Parallel communicating systems of pushdown automata (PCPA) were introduced in
(Csuhaj-Varj{\'u} et. al. 2000) and in their centralized variants shown to be
able to simulate nondeterministic one-way multi-head pushdown automata. A
claimed converse simulation for returning mode (Balan 2009) turned out to be
incomplete (Otto 2012) and a language was suggested for separating these PCPA
of degree two (number of pushdown automata) from nondeterministic one-way
two-head pushdown automata. We show that the suggested language can be accepted
by the latter computational model. We present a different example over a single
letter alphabet indeed ruling out the possibility of a simulation between the
models. The open question about the power of centralized PCPA working in
returning mode is then settled by showing them to be universal. Since the
construction is possible using systems of degree two, this also improves the
previous bound three for generating all recursively enumerable languages.
Finally PCPAs are restricted in such a way that a simulation by multi-head
automata is possible
The spatial coverage of dairy cattle urine patches in an intensively grazed pasture system
Accurate field data on the paddock area affected by cow urine depositions are critical to the estimation and modelling of nitrogen (N) losses and N management in grazed pasture systems. A new technique
using survey-grade global positioning system (GPS) technology was developed to precisely measure the paddock spatial area coverage, diversity and distribution of dairy cattle urine patches in grazed paddocks over time. A 4-year study was conducted on the Lincoln University Dairy Farm (LUDF), Canterbury, New Zealand, from 2003 to 2007. Twelve field plots, each 100mÂČ in area, were established
on typical grazing areas of the farm. All urine and dung deposits within the plots were visually identified, the pasture response area (radius) measured and position marked with survey-grade GPS. The plots were grazed as part of the normal grazing rotation of the farm and urine and dung deposits measured at 12-week intervals. The data were collated using spatial (GIS) software and an assessment of annual urine patch coverage and spatial distribution was made. Grazing intensities ranged from
17645 to 30295 cow grazing h/ha/yr. Mean annual areas of urine patches ranged from 0·34 to 0·40mÂČ (4-year mean 0·37±0·009mÂČ), with small but significant variation between years and seasons. Mean annual urine patch numbers were 6240±124 patches/ha/yr. The mean proportional area coverage for a single sampling event or season was 0·058 and the mean proportional annual urine patch coverage was 0·232±0·0071. There was a strong linear relationship between annual cow grazing h/ha and urine patch numbers/ha (RÂČ=0·69) and also annual urine patch area coverage (RÂČ=0·77). Within the stocking densities observed in this study, an annual increase of 10 000 cow grazing h/ha increased urine patch numbers by 1800 urine patches/ha/yr and annual urine patch area coverage by 0·07. This study presents new quantitative data on urine patch size, numbers and the spatial coverage of patches on a temporal basis
P Systems with Minimal Left and Right Insertion and Deletion
In this article we investigate the operations of insertion and deletion performed
at the ends of a string. We show that using these operations in a P systems
framework (which corresponds to using specific variants of graph control), computational
completeness can even be achieved with the operations of left and right insertion and
deletion of only one symbol
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems
The operations drip and mate considered in (mem)brane computing resemble the
operations cut and recombination well known from DNA computing. We here
consider sets of vesicles with multisets of objects on their outside membrane
interacting by drip and mate in two different setups: in test tube systems, the
vesicles may pass from one tube to another one provided they fulfill specific
constraints; in tissue-like P systems, the vesicles are immediately passed to
specified cells after having undergone a drip or mate operation. In both
variants, computational completeness can be obtained, yet with different
constraints for the drip and mate operations
Untyped Recursion Schemes and Infinite Intersection Types
Abstract. A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then model-checked. As recursion schemes are essentially terms of the simply-typed lambda-calculus with recursion and tree constructors, however, it was not clear how the new framework applies to programs written in languages with more advanced type systems. To circumvent the limitation, this paper introduces an untyped version of recursion schemes and develops an in-finite intersection type system that is equivalent to the model checking of untyped recursion schemes, so that the model checking can be re-duced to type checking as in recent work by Kobayashi and Ong for typed recursion schemes. The type system is undecidable but we can obtain decidable subsets of the type system by restricting the shapes of intersection types, yielding a sound (but incomplete in general) model checking algorithm.
Layered control architectures in robots and vertebrates
We revieiv recent research in robotics, neuroscience, evolutionary neurobiology, and ethology with the aim of highlighting some points of agreement and convergence. Specifically, we com pare Brooks' (1986) subsumption architecture for robot control with research in neuroscience demonstrating layered control systems in vertebrate brains, and with research in ethology that emphasizes the decomposition of control into multiple, intertwined behavior systems. From this perspective we then describe interesting parallels between the subsumption architecture and the natural layered behavior system that determines defense reactions in the rat. We then consider the action selection problem for robots and vertebrates and argue that, in addition to subsumption- like conflict resolution mechanisms, the vertebrate nervous system employs specialized selection mechanisms located in a group of central brain structures termed the basal ganglia. We suggest that similar specialized switching mechanisms might be employed in layered robot control archi tectures to provide effective and flexible action selection
Radiation therapy and photodynamic therapy for biliary tract and ampullary carcinomas
The purpose of radiation therapy for unresectable biliary tract cancer is to prolong survival or prolong stent patency, and to provide palliation of pain. For unresectable bile duct cancer, there are a number of studies showing that radiation therapy is superior to the best supportive care. Although radiation therapy is used in many institutions, no large randomized controlled trials (RCTs) have been performed to date and the evidence level supporting the superiority of this treatment is low. Because long-term relief of jaundice is difficult without using biliary stenting, a combination of radiation therapy and stent placement is commonly used. As radiation therapy, external-beam radiation therapy is usually performed, but combined use of intraluminal brachytherapy with external beam radiation therapy is more useful for making the treatment more effective. There are many reports demonstrating improved response rates as well as extended survival and time to recurrence achieved by this combination therapy. Despite the low level of the evidence, this combination therapy is performed at many institutions. It is expected that multiinstitutional RCTs will be carried out. Unresectable gallbladder cancer with a large focus is usually extensive, and normal organs with high radio sensitivity exist contiguously with it. Therefore, only limited anticancer effects are to be expected from external beam radiation therapy for this type of cancer. The number of reports on ampullary cancer is small and the role of radiation therapy in this cancer has not been established. Combination treatment for ampullary cancer consists of either a single use of intraoperative radiation therapy, postoperative external beam radiation therapy or intraluminal brachytherapy, or a combination of two or three of these therapies. Intraoperative radiation therapy is superior in that it enables precise irradiation to the target site, thereby protecting adjacent highly radiosensitive normal tissues from irradiation. There are reports showing extended survival, although not significant, in groups undergoing intraoperative or postoperative radiation therapy compared with groups without radiation therapy. To date, there are no reports of large RCTs focusing on the significance of radiation therapy as a postoperative adjuvant treatment, so its usefulness as a postoperative adjuvant treatment is not proven. An alternative treatment is photodynamic therapy. There is an RCT demonstrating that, in unresectable bile duct cancer, extended survival and improved quality of life (QOL) have been achieved through a combination of photodynamic therapy and biliary stenting, compared with biliary stenting alone. Results from large RCTs are desired
- âŠ